Probabilistic coverage in mobile directional sensor networks: a game theoretical approach

Game Theoretical Algorithm for Coverage Optimization in Wireless Sensor Networks

Game Theory is fundamentally and applicably addressed and incorporated to analyze the coverage problems in Wireless Sensor Networks (WSN) in this paper. GCC (Game-theoretical Complete Coverage) algorithm is used to ensure whole network coverage mainly through adjusting the covering range of nodes and controlling the network redundancy. Hereafter, by designing suitable cost and utility function ...

Coverage Quality in Visual Sensor Networks

Improving Energy-Efficient Target Coverage in Visual Sensor Networks

Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) ...

Game-theoretical learning for sensor networks

This note provides an indication of potential uses of gametheoretical learning algorithms in sensor networks. In particular we consider the sensor network problem as a fixed optimisation problem, and propose methods that use algorithms designed for repeated normal-form games to induce globally optimal behaviour. Many of the standard algorithms for learning in games are proven to converge in pot...

Connected Coverage in Wireless Sensor Networks with Directional Antennas

In this paper we address a new unexplored problem concerning directional antennas in wireless sensor networks (WSNs), namely the optimal patterns that achieve connected coverage. As their name implies, directional antennas can focus their transmission energy in a certain direction. This feature gives rise to lower cross-interference and greater communication distance, given certain amount of en...